An Improved Ant Colony Algorithm to Solve Vehicle Routing Problem with Time Windows
نویسندگان
چکیده
This paper presents an improved ant colony optimization algorithm (ACO algorithm) based on Ito differential equations, the proposed algorithm integrates the versatility of Ito thought with the accuracy of ACO algorithm in solving the vehicle routing problem (VRP), and it executes simultaneous move and wave process, and employs exercise ability to unify move and wave intensity. Move and wave operator rely on attractors and random perturbations to set the motion direction. In the experiment part, this improved algorithm is implemented for solving vehicle routing problem with soft time windows (VRPSTW), and tested by Solomon Benchmark standard test dataset, the result shows that the proposed algorithm is effective and feasible.
منابع مشابه
An Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملAn Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملA Green Competitive Vehicle Routing Problem under Uncertainty Solved by an Improved Differential Evolution Algorithm
Regarding the development of distribution systems in the recent decades, fuel consumption of trucks has increased noticeably, which has a huge impact on greenhouse gas emissions. For this reason, the reduction of fuel consumption has been one of the most important research areas in the last decades. The aim of this paper is to propose a robust mathematical model for a variant of a vehicle routi...
متن کاملA Hybrid Ant Colony System for Vehicle Routing Problem with Time Windows
Vehicle Routing Problem with Time Windows (VRPTW) is a well known NP hard combinatorial scheduling optimization problem in which minimum number of routes have to be determined to serve all the customers within their specified time windows. Different analytic and heuristic approaches have been tried to solve such problems. The proposed hybrid algorithm uses ant colony system as well as random se...
متن کامل